Alternative Models for Quantum Computation
نویسندگان
چکیده
We propose and study two new computational models for quantum computation, and infer new insights about the circumstances that give quantum computers an advantage over classical ones. The bomb query complexity model is a variation on the query complexity model, inspired by the Elitzur-Vaidman bomb tester. In this model after each query to the black box the result is measured, and the algorithm fails if the measurement gives a 1. We show that the bomb query complexity is asymptotically the square of the usual quantum query complexity. We then show a general method of converting certain classical algorithms to bomb query algorithms, which then give improved quantum algorithms. We apply this general method to graph problems, giving improved quantum query algorithms for single-source shortest paths and maximum bipartite matching. Normalizer circuits are a class of restricted quantum circuits defined on Hilbert spaces associated with Abelian groups. These circuits generalize the Clifford group, and are composed of gates implementing quantum Fourier transforms, automorphisms, and quadratic phases. We show that these circuits can be simulated efficiently on a classical computer even on infinite Abelian groups (the finite case is known [1, 21), as long as the group is decomposed into primitve subgroups. This result gives a generalization of the Gottesman-Knill theorem to infinite groups. However, if the underlying group is not decomposed (the group is a black box group) then normalizer circuits include many well known quantum algorithms, including Shor's factoring algorithm. There is therefore a large difference in computational power between normalizer circuits over explicitly decomposed versus black box groups. In fact, we show that a version of the problem of decomposing Abelian groups is complete for the complexity class associated with normalizer circuits over black box groups: any such normalizer circuit can be simulated classically given the ability to decompose Abelian groups. Thesis Supervisor: Edward H. Farhi Title: Professor of Physics; Director, Center for Theoretical Physics
منابع مشابه
Models of Quantum Algorithms in Sets and Relations
In this paper we construct abstract models of blackbox quantum algorithms using a model of quantum computation in sets and relations, a setting that is usually considered as a model for nondeterministic classical computation. This work provides an alternative model of quantum computation (QCRel) that, though unphysical, nevertheless faithfully models its computational structure. Our main result...
متن کاملPhotosensitization of coronene–purine hybrids for photodynamic therapy
Photosensitization properties of coronene-purine (Cor-P) hybrids for photodynamic therapy (PDT) have been investigated in this work. Eight hybrid Cor-P models have been designed by the additional of adenine (A) and guanine (G) nucleobase to Cor species. The evaluated absorption and emission energies indicated that the singular models are not good at all for PDT process whereas their hybrid mode...
متن کاملQuantum Computation Beyond the Circuit Model
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other models of quantum computation exist which provide useful alternative frameworks for both discovering new quantum algorithms and devising new physical implemen...
متن کاملQuantum Computation Beyond the Circuit Model by Stephen Paul
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other models of quantum computation exist which provide useful alternative frameworks for both discovering new quantum algorithms and devising new physical implemen...
متن کاملTheoretical computation of the quantum transport of zigzag mono-layer Graphenes with various z-direction widths
The quantum transport computations have been carried on four different width of zigzag graphene using a nonequilibrium Green’s function method combined with density functional theory. The computed properties are included transmittance spectrum, electrical current and quantum conductance at the 0.3V as bias voltage. The considered systems were composed from one-layer graphene sheets differing w...
متن کاملTheoretical computation of the quantum transport of zigzag mono-layer Graphenes with various z-direction widths
The quantum transport computations have been carried on four different width of zigzag graphene using a nonequilibrium Green’s function method combined with density functional theory. The computed properties are included transmittance spectrum, electrical current and quantum conductance at the 0.3V as bias voltage. The considered systems were composed from one-layer graphene sheets differing w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015